Spectral Representation of Fingerprints
نویسندگان
چکیده
Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and directions suffering from various deformations such as translation, rotation and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with a template protection scheme, which requires a fixed-length feature vector. This paper introduces the idea and algorithm of spectral minutiae representation. A correlation based spectral minutiae matching algorithm is presented and evaluated. The scheme shows a promising result, with an equal error rate of 0.2% on manually extracted minutiae.
منابع مشابه
On the solving matrix equations by using the spectral representation
The purpose of this paper is to solve two types of Lyapunov equations and quadratic matrix equations by using the spectral representation. We focus on solving Lyapunov equations $AX+XA^*=C$ and $AX+XA^{T}=-bb^{T}$ for $A, X in mathbb{C}^{n times n}$ and $b in mathbb{C} ^{n times s}$ with $s < n$, which $X$ is unknown matrix. Also, we suggest the new method for solving quadratic matri...
متن کاملRepresenting Spectral data using LabPQR color space in comparison to PCA method
In many applications of color technology such as spectral color reproduction it is of interest to represent the spectral data with lower dimensions than spectral space’s dimensions. It is more than half of a century that Principal Component Analysis PCA method has been applied to find the number of independent basis vectors of spectral dataset and representing spectral reflectance with lower di...
متن کاملA New Dictionary Construction Method in Sparse Representation Techniques for Target Detection in Hyperspectral Imagery
Hyperspectral data in Remote Sensing which have been gathered with efficient spectral resolution (about 10 nanometer) contain a plethora of spectral bands (roughly 200 bands). Since precious information about the spectral features of target materials can be extracted from these data, they have been used exclusively in hyperspectral target detection. One of the problem associated with the detect...
متن کاملHyperspectral Image Classification Based on the Fusion of the Features Generated by Sparse Representation Methods, Linear and Non-linear Transformations
The ability of recording the high resolution spectral signature of earth surface would be the most important feature of hyperspectral sensors. On the other hand, classification of hyperspectral imagery is known as one of the methods to extracting information from these remote sensing data sources. Despite the high potential of hyperspectral images in the information content point of view, there...
متن کاملError bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملGaussian Mixture Modeling Using Short Time Fourier Transform Features for Audio Fingerprinting
In Audio fingerprinting, a song must be recognized by matching an extracted fingerprint to a database of previously computed fingerprints. One of the key issues in fingerprinting is the generation of fingerprints that provide discrimination among different songs and at the same time invariant to the distorted versions of the same song. In this paper, we evaluate various features such as spectra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007